#include<iostream>
using namespace std;
#include<queue>
#include"stack.h"
#include"queue.h"
//#include<stack>

//void test_stack0()
//{
//	stack<int> s1;
//	s1.push(1);
//	s1.push(2);
//	s1.push(3);
//	s1.push(4);
//
//	cout << s1.size() << endl;
//
//	while (!s1.empty())
//	{
//		cout << s1.top() << " ";
//		s1.pop();
//	}
//	cout << endl;
//}

void test_stack1()
{
	//xlf::stack<int, list<int>> v;
	//xlf::stack<int, deque<int>> v;

	xlf::stack<int, vector<int>> v;
	v.push(1);
	v.push(2);
	v.push(3);
	v.push(4);
	v.push(5);

	while (!v.empty())
	{
		cout << v.top() << " ";
		v.pop();
	}
	cout << endl;


}

void test_queue1()
{
	//xlf::queue<int> q;
	xlf::queue<int, list<int>> q;
	q.push(1);
	q.push(2);
	q.push(3);
	q.push(4);
	q.push(5);

	while (!q.empty())
	{
		cout << q.front() << " ";
		q.pop();
	}
	cout << endl;


}


int main()
{
	//test_stack0();
	//test_stack1();
	test_queue1();
	return 0;
}
